Distributed Age-Layered Novelty Search
نویسندگان
چکیده
Novelty search is a powerful biologically motivated method for discovering successful behaviors especially in deceptive domains, like those in artificial life. This paper extends the biological motivation further by distributing novelty search to run in parallel in multiple islands, with periodic migration among them. In this manner, it is possible to scale novelty search to larger populations and more diverse runs, and also to harness available computing power better. A second extension is to improve novelty search’s ability to solve practical problems by biasing the migration and elitism towards higher fitness. The resulting method, DANS, is shown to find better solutions much faster than pure single-population novelty search, making it a promising candidate for solving deceptive design problems in the real world.
منابع مشابه
Scalable RFID Security Protocol
Radio Frequency Identification (RFID) system poses serious security and privacy risks that must be carefully mitigated in order to realize the numerous benefits the technology has to offer. In this talk I am going to present different security issues required to secure a RFID system. I will also describe some desirable characteristics of RFID security protocols for use in operational distribute...
متن کاملConstrained Novelty Search: A Study on Game Content Generation
Novelty search is a recent algorithm geared toward exploring search spaces without regard to objectives. When the presence of constraints divides a search space into feasible space and infeasible space, interesting implications arise regarding how novelty search explores such spaces. This paper elaborates on the problem of constrained novelty search and proposes two novelty search algorithms wh...
متن کاملPMCNS: Using a Progressively Stricter Fitness Criterion to Guide Novelty Search
Novelty search is an evolutionary approach in which the population is driven towards behavioural innovation instead of towards a fixed objective. The use of behavioural novelty to score candidate solutions precludes convergence to local optima. However, in novelty search, significant effort may be spent on exploration of novel, but unfit behaviours. The authors propose progressive minimal crite...
متن کاملCombination of Novelty Search and Fitness-Based Search Applied to Robot Body-Brain Co-Evolution
Evolutionary algorithms are a frequently used technique for designing morphology and controller of a robot. However, a significant challenge for evolutionary algorithms is premature convergence to local optima. Recently proposed Novelty Search algorithm introduces a radical idea that premature convergence can be avoided by ignoring the original objective and searching for any novel behaviors in...
متن کاملChallenges of Distributed Search Across Digital Libraries
We present the MINERVA project that tackles the problem of collaborative search across a large number of digital libraries. The search engine is layered on top of a Chord-style peer-to-peer overlay network that connects an a-priori unlimited number of peers or digital libraries. Each library posts a small amount of metadata to a conceptually global, but physically distributed directory. This di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016